LCL Problems on Grids
نویسندگان
چکیده
LCLs or locally checkable labelling problems (e.g. maximal independent set, maximal matching, and vertex colouring) in the LOCAL model of computation are very well-understood in cycles (toroidal 1-dimensional grids): every problem has a complexity of O(1), Θ(log∗ n), or Θ(n), and the design of optimal algorithms can be fully automated. This work develops the complexity theory of LCL problems for toroidal 2-dimensional grids. The complexity classes are the same as in the 1-dimensional case: O(1), Θ(log∗ n), and Θ(n). However, given an LCL problem it is undecidable whether its complexity is Θ(log∗ n) or Θ(n) in 2-dimensional grids. Nevertheless, if we correctly guess that the complexity of a problem is Θ(log∗ n), we can completely automate the design of optimal algorithms. For any problem we can find an algorithm that is of a normal form A′ ◦ Sk, where A′ is a finite function, Sk is an algorithm for finding a maximal independent set in kth power of the grid, and k is a constant. Finally, partially with the help of automated design tools, we classify the complexity of several concrete LCL problems related to colourings and orientations. ar X iv :1 70 2. 05 45 6v 2 [ cs .D C ] 2 4 M ay 2 01 7
منابع مشابه
Equidistribution grids for two-parameter convection–diffusion boundary-value problems
In this article, we propose an adaptive grid based on mesh equidistribution principle for two-parameter convection-diffusion boundary value problems with continuous and discontinuous data. A numerical algorithm based on an upwind finite difference operator and an appropriate adaptive grid is constructed. Truncation errors are derived for both continuous and discontinuous problems. Parameter uni...
متن کاملVariable density preserving topology grids and the digital models for the plane
We define LCL decompositions of the plane and investigate the advantages of using such decompositions in the context of digital topology. We show that discretization schemes based on such decompositions associate, to each LCL tiling of the plane, the digital model preserving the local topological structure of the object. We prove that for any LCL tiling of the plane, the digital model is necess...
متن کاملDistributed Power Balance and Damping Control for High Power Multiport LCL DC Hub
Abstract— DC hubs are centrally located in DC grids and they are expected to operate autonomously under wide range of operating conditions. To achieve secure operation without intervention from dispatcher and to damp the internal oscillatory modes, a distributed power balance and damping controller for high power multiport LCL (Inductor-Capacitor-Inductor) DC hub is proposed in this paper. Nat...
متن کاملConnection between continuous and digital n-manifolds and the Poincare conjecture
We introduce LCL covers of closed n-dimensional manifolds by n-dimensional disks and study their properties. We show that any LCL cover of an n-dimensional sphere can be converted to the minimal LCL cover, which consists of 2n+2 disks. We prove that an LCL collection of n-disks is a cover of a continuous n-sphere if and only if the intersection graph of this collection is a digital n-sphere. Us...
متن کاملStability Improvement of Grid-connected Converter with LCL Filter based on Capacitor Current Active Damping by Computational Delay Reduction
Nowadays, LCL filters utilization to suppress the grid-connected inverter switching harmonics is expanding and various methods such as capacitor current active damping scheme could be investigated to damp out these harmonics. However, the computational delays including control system, and PWM switching delays have significant effect on damping system stability. In most of LCL filter parameter d...
متن کامل